An Improved Order-Preserving Pattern Matching Algorithm Using Fingerprints

Two strings of the same length are order isomorphic if their relative orders same. The order-preserving pattern matching problem is to find all substrings text T that P when T(|T|=n) and P(|P|=m) given. An O(mn+nqlogq+q!)-time algorithm using O(m+q!) space for has been proposed utilizing fingerprints q-grams based on factorial number system bad character heuristic. In this paper, we propose an O(mn+2q)-time O(m+2q) problem, but converted binary numbers. A comparative experiment three types time series data demonstrates faster than existing algorithms because it reduces isomorphism tests.